Degree sequences of digraphs with highly irregular property
نویسندگان
چکیده
A digraph such that for each its vertex, vertices of the outneighbourhood have different in-degrees and vertices of the inneighbourhood have different out-degrees, will be called an HI-digraph. In this paper, we give a characterization of sequences of pairs of outand in-degrees of HI-digraphs.
منابع مشابه
Sufficient conditions on the zeroth-order general Randic index for maximally edge-connected digraphs
Let D be a digraph with vertex set V(D) .For vertex v V(D), the degree of v, denoted by d(v), is defined as the minimum value if its out-degree and its in-degree . Now let D be a digraph with minimum degree and edge-connectivity If is real number, then the zeroth-order general Randic index is defined by . A digraph is maximally edge-connected if . In this paper we present sufficient condi...
متن کاملExtremum degree sets of irregular oriented graphs and pseudodigraphs
A digraph in which any two vertices have distinct degree pairs is called irregular. Sets of degree pairs for all irregular oriented graphs 318 Z. Dziechcińska-Halamoda, Z. Majcher, J. Michael and ... (also loopless digraphs and pseudodigraphs) with minimum and maximum size are determined. Moreover, a method of constructing corresponding irregular realizations of those sets is given.
متن کاملDegree sequences of highly irregular graphs
We call a simple graph highly irregular if each of its vertices is adjacent only to vertices with distinct degrees. In this paper we examine the degree sequences of highly irregular graphs. We give necessary and sufficient conditions for a sequence of positive integers to be the degree sequence of a highly irregular graph.
متن کاملEven factors, jump systems, and discrete convexity
A jump system, which is a set of integer lattice points with an exchange property, is an extended concept of a matroid. Some combinatorial structures such as the degree sequences of the matchings in an undirected graph are known to form a jump system. On the other hand, the maximum even factor problem is a generalization of the maximum matching problem into digraphs. When the given digraph has ...
متن کاملIrregularity strength of digraphs
It is an elementary exercise to show that any non-trivial simple graph has two vertices with the same degree. This is not the case for digraphs and multigraphs. We consider generating irregular digraphs from arbitrary digraphs by adding multiple arcs. To this end, we define an irregular labeling of a digraph D to be an arc labeling of the digraph such that the ordered pairs of the sums of the i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discussiones Mathematicae Graph Theory
دوره 18 شماره
صفحات -
تاریخ انتشار 1998